A Termination Ordering for Higher Order Rewrite Systems
نویسندگان
چکیده
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate su cient properties of the termination functions for our method to apply. Thereby we describe a class of di erent orderings. Finally we compare our method to previously published extensions of the recursive path ordering into the higher order setting.
منابع مشابه
A Termination Ordering for Higher Order Rewrite System
We present an extension of the recursive path ordering for the purpose of showing termination of higher order rewrite systems. Keeping close to the general path ordering of Dershowitz and Hoot, we demonstrate the necessary properties of the termination functions for our method to apply, thus describe a class of diierent orderings. We also give a counterexample to a previously published extensio...
متن کاملAn Lpo-based Termination Ordering for Higher-order Terms without -abstraction
We present a new precedence-based termination ordering for (polymorphic) higher-order terms without-abstraction. The ordering has been designed to strictly generalize the lexicographic path ordering (on rst-order terms). It is relatively simple, but can be used to prove termination of many higher-order rewrite systems, especially those corresponding to typical functional programs. We establish ...
متن کاملA monotonic Higher - Order Semantic
There is an increasing use of ((rst-and higher-order) rewrite rules in many programming languages and logical systems. The recursive path ordering (RPO) is a well-known tool for proving termination of such rewrite rules in the rst-order case Der82]. However, RPO has some weaknesses. For instance, since it is a simpliication ordering, it can only handle simply terminating systems. Several techni...
متن کاملA Monotonic Higher - Order Semantic PathOrderingCristina Borralleras 1 and Albert Rubio 21 Universitat
There is an increasing use of ((rst-and higher-order) rewrite rules in many programming languages and logical systems. The recursive path ordering (RPO) is a well-known tool for proving termination of such rewrite rules in the rst-order case Der82]. However, RPO has some weaknesses. For instance, since it is a simpliication ordering, it can only handle simply terminating systems. Several techni...
متن کاملProving Termination of Higher-order Rewrite Systems
This paper deals with termination proofs for Higher-Order Rewrite Systems (HRSs), introduced in [Nip9l, Nip93]. This formalism combines the computational aspects of term rewriting and simply typed lambda calculus. Our result is a proof technique for the termination of a HRS, similar to the proof technique "Termination by interpretation in a well-founded monotone algebra" described in [Zan93]. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995